Shared processor scheduling

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Shared processor scheduling

We study the shared processor scheduling problem with a single shared processor where a unit time saving (weight) obtained by processing a job on the shared processor depends on the job. A polynomialtime optimization algorithm has been given for the problem with equal weights in the literature. This paper extends that result by showing an O(n log n) optimization algorithm for a class of instanc...

متن کامل

Shared multi-processor scheduling

We study shared multi-processor scheduling problem where each job can be executed on its private processor and simultaneously on one of many processors shared by all jobs in order to reduce the job’s completion time due to processing time overlap. The total weighted overlap of all jobs is to be maximized. The problem models subcontracting scheduling in supply chains and divisible load schedulin...

متن کامل

Performance of Hierarchical Processor Scheduling in Shared-Memory Multiprocessor Systems

Processor scheduling policies can be broadly divided into space-sharing and time-sharing policies. Space-sharing policies partition system processors and each partition is allocated exclusively to a job. In time-sharing policies, processors are temporally shared by jobs (e.g., in a round robin fashion). Space-sharing policies can be either static (processor allocation remains constant during th...

متن کامل

K-processor Scheduling

It is shown that the Precedence Constrained K-Processor Scheduling problem is W2]-hard. This means that there does not exist a constant c, such that for all xed K, the Precedence Constrained K-Processor Scheduling problem can be solved in O(n c) time, unless an unlikely collapse occurs in the parameter-ized complexity hierarchy introduced by Downey and Fellows (see 5]). That is, if the problem ...

متن کامل

Eclipse Processor Scheduling

Eclipse is an architectural framework for on-chip CPU and coprocessor communication, combining application configuration flexibility with the efficiency of functionspecific hardware. A Kahn process network application model is supported by a generic communication infrastructure and function-specific processors with multi-tasking capabilities. High data bandwidth and limited stream buffer memory...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Scheduling

سال: 2018

ISSN: 1094-6136,1099-1425

DOI: 10.1007/s10951-018-0566-0